A fixed-parameter algorithm for a unit-execution-time unit-communication-time tasks scheduling problem with a limited number of identical processors

This paper considers the minimization of maximum lateness for a set dependent tasks with unit duration, communication delays release times and due dates. The number processors is limited, each task requires one processor its execution. A time window built from an upper bound minimum associated to task. parameter considered pathwidth interval graph. fixed-parameter algorithm based on dynamic programming approach developed solve this optimization problem. is, as far we know, first scheduling problem limited processors.